Improvement of path analysis algorithm in social networks based on HBase

When social network has reached hundreds of million users, the analysis of data in social network services becomes very important. Understanding how nodes interconnect in large graphs is an essential problem in many fields. In order to find connecting nodes between two nodes or two groups of source nodes in huge graphs, we propose a parallelized data-mining algorithm to get the shortest path between nodes in a social network based on HBase distributed key/value store. Our algorithm Y. Qiang · B. Pei · J. Zhao · W. Wu · X. Zhang (B) · Y. Li College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan, China e-mail: [email protected] Y. Qiang e-mail: [email protected] B. Pei e-mail: [email protected] J. Zhao e-mail: [email protected] Y. Li e-mail: [email protected] W. Wu · L. Wu Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA e-mail: [email protected] L. Wu e-mail: [email protected] X. Zhang College of Information Sciences and Technology, Pennsylvania State University, State College, PA, USA